2,799 research outputs found

    Regularization by noise and stochastic Burgers equations

    Full text link
    We study a generalized 1d periodic SPDE of Burgers type: ∂tu=−Aθu+∂xu2+Aθ/2ξ \partial_t u =- A^\theta u + \partial_x u^2 + A^{\theta/2} \xi where θ>1/2\theta > 1/2, −A-A is the 1d Laplacian, ξ\xi is a space-time white noise and the initial condition u0u_0 is taken to be (space) white noise. We introduce a notion of weak solution for this equation in the stationary setting. For these solutions we point out how the noise provide a regularizing effect allowing to prove existence and suitable estimates when θ>1/2\theta>1/2. When θ>5/4\theta>5/4 we obtain pathwise uniqueness. We discuss the use of the same method to study different approximations of the same equation and for a model of stationary 2d stochastic Navier-Stokes evolution.Comment: clarifications and small correction

    Nonequilibrium Central Limit Theorem for a Tagged Particle in Symmetric Simple Exclusion

    Get PDF
    We prove a nonequilibirum central limit theorem for the position of a tagged particle in the one-dimensional nearest-neighbor symmetric simple exclusion process under diffusive scaling starting from a Bernoulli product measure associated to a smooth profile \rho_0:\bb R\to [0,1]

    Universality of trap models in the ergodic time scale

    Full text link
    Consider a sequence of possibly random graphs GN=(VN,EN)G_N=(V_N, E_N), N≥1N\ge 1, whose vertices's have i.i.d. weights {WxN:x∈VN}\{W^N_x : x\in V_N\} with a distribution belonging to the basin of attraction of an α\alpha-stable law, 0<α<10<\alpha<1. Let XtNX^N_t, t≥0t \ge 0, be a continuous time simple random walk on GNG_N which waits a \emph{mean} WxNW^N_x exponential time at each vertex xx. Under considerably general hypotheses, we prove that in the ergodic time scale this trap model converges in an appropriate topology to a KK-process. We apply this result to a class of graphs which includes the hypercube, the dd-dimensional torus, d≥2d\ge 2, random dd-regular graphs and the largest component of super-critical Erd\"os-R\'enyi random graphs
    • …
    corecore